HEURISTIC’S JOB ORDER EFFICIENCY IN TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING OF EQUAL-LENGTH JOBS
نویسندگان
چکیده
منابع مشابه
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighted completion times ∑n i=1 wiCi of the jobs. We propose for this problem the first parameterized algorithm on the number k of different weights. The runtime of the proposed algorithm is O(( n k + 1)n) and hence, the pr...
متن کاملPreemptive scheduling of equal-length jobs to maximize weighted throughput
We study the problem of computing a preemptive schedule of equal-length jobs with given release times and deadlines. Each job is assigned a weight, and our goal is to maximize the weighted throughput, which is the total weight of completed jobs. In Graham’s notation this problem is described as (1|rj ; pj=p; pmtn| ∑ wjUj). We provide an O(n )-time algorithm for this problem, improving the previ...
متن کاملPreemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
We study the problem of preemptive scheduling of n equal-length jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. Recently, Brucker and Kravchenko [1] proved that the optimal schedule can be computed in polynomial time by solving a linear program with O(n) variables and constraints, followed by some substantial post-processing (w...
متن کاملA Parameterized Algorithm for the Preemptive Scheduling of Equal-Length Jobs
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighted completion times ∑n i=1 wiCi of the jobs. We propose for this problem the first parameterized algorithm on the number k of different weights. The runtime of the proposed algorithm is O((nk + 1) n) and hence, this is...
متن کاملImproved Online Scheduling in Maximizing Throughput of Equal Length Jobs
Inspired by Mechanism Design, we study an online scheduling problem in maximizing throughput of equal length jobs with application in Auctions. We design monotone algorithms with improved competitive ratio for the problem in both models of restart and resume. Due to the monotonicity property, our algorithms deduce truthful mechanisms with the same competitive ratio in maximizing the total welfa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KPI Science News
سال: 2020
ISSN: 2617-5509
DOI: 10.20535/kpi-sn.2020.2.181869